A Reordering and Mapping Algorithm for Parallel Sparse Cholesky Factorization
نویسندگان
چکیده
A judiciously chosen symmetric permutation can signiicantly reduce the amount of storage and computation for the Cholesky factorization of sparse matrices. On distributed memory machines, the issue of mapping data and computation on processors is also important. Previous research on ordering for paral-lelism has focussed on idealized measures like execution time on an unbounded number of processors, with zero communication costs. In this paper, we propose an ordering and mapping algorithm that attempts to minimize communication and performs load-balancing of work among the processors. Performance results on an Intel iPSC/860 hypercube are presented to demonstrate its eeectiveness.
منابع مشابه
A High Performance Sparse Cholesky Factorization Algorithm For Scalable Parallel Computers∗†
This paper presents a new parallel algorithm for sparse matrix factorization. This algorithm uses subforest-to-subcube mapping instead of the subtree-to-subcube mapping of another recently introduced scheme by Gupta and Kumar [10]. Asymptotically, both formulations are equally scalable on a wide range of architectures and a wide variety of problems. But the subtree-to-subcube mapping of the ear...
متن کاملEfficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer
We investigate the effect of load balancing when performing Cholesky factorization on a massively parallel SIMD computer. In particular we describe a supernodal algorithm for performing sparse Cholesky factorization. The way the matrix is mapped onto the processors has significant effect on its efficiency. We show that this assignment problem can be modeled as a graph coloring problem in a weig...
متن کاملA High Performance Sparse Cholesky Factorization Algorithm
This paper presents a new parallel algorithm for sparse matrix factorization. This algorithm uses subforest-to-subcube mapping instead of the subtree-to-subcube mapping of another recently introduced scheme by Gupta and Kumar 13]. Asymptotically, both formulations are equally scalable on a wide range of architectures and a wide variety of problems. But the subtree-to-subcube mapping of the earl...
متن کاملEecient Sparse Cholesky Factorization on a Parallel Simd Computer
We investigate the eeect of load balancing when performing Cholesky factor-ization on a SIMD computer. In particular we describe a supernodal algorithm for performing sparse Cholesky factorization. The way the matrix is mapped onto the processors has signiicant eeect on its eeciency. We show that this assignment problem can be modeled as a graph coloring problem in a weighted graph. By a simple...
متن کاملTask Scheduling using Block Dependency DAG of Block-Oriented Sparse Cholesky Factorizationy
The block-oriented sparse Cholesky factorization decomposes a sparse matrix into rectangular sub-blocks, and handles each block as a computational unit in order to increase data reuse in a hierarchical memory system. As well, the factorization method increases the degree of concurrency with the reduction of communication volumes so that it performs more eeciently on a distributed-memory multipr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994